Minimizing UG: Constraints upon Constraints
نویسنده
چکیده
This paper questions the validity of various assumptions central to treatments of featural processes such as vowel and consonant harmony, namely that features are universal, that constraints are universal, that feature scales are universal, and so on. The paper begins with a discussion of various phonetic, phonological, and typological properties of distinctive features. It goes on to discuss various properties of constraints, examining in particular the question of constraint plausibility. The class of anti-faithfulness constraints is examined in this regard, including a case study of Luo voicing polarity. It is customary in generative phonology to attribute a complex structure to Universal Grammar (UG), with numerous properties of natural language explained by the intrinsic structure of that grammatical component. For example, the sets of segments that exhibit class behavior are considered to be defined universally, with a single feature set appropriate for all languages (Chomsky & Halle 1968, etc.). Within Optimality Theory, such universality has been extended to the constraint set, with the postulation that phonological grammars draw on a fixed constraint set (Prince & Smolensky 1993, etc.). A major task for the linguist under such a conception is to uncover the properties of UG, for example, to discover the nature of the feature set and the composition of the constraint set. Given a ‘built-in’ set of constraints, for example, the problem for language acquisition consists of ranking the set of constraints but does not require the acquisition of constraints per se (Tesar 1995, etc.). Following work such as Hume & Tserdanelis (2002), Pulleyblank (2003), Mielke (2004, 2005), etc., I argue here that such a structure for UG is unlikely. I begin by considering certain properties of distinctive features, concluding that distinctive features are learned, not supplied by UG. It follows that if features are acquired, not given, then any constraints referring to features must also be learned, not precompiled. Certain implications for feature reference, constraint types and locality will be examined.
منابع مشابه
Minimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملAn algorithm for integrated worker assignment, mixed-model two-sided assembly line balancing and bottleneck analysis
This paper addresses a multi-objective mixed-model two-sided assembly line balancing and worker assignment with bottleneck analysis when the task times are dependent on the worker’s skill. This problem is known as NP-hard class, thus, a hybrid cyclic-hierarchical algorithm is presented for solving it. The algorithm is based on Particle Swarm Optimization (PSO) and Theory of Constraints (TOC) an...
متن کاملMinimizing the supplying cost of leverage items: a mathematical approach
In the new competitive environment, selecting and planning of the supply chain is very crucial and involves evaluation of many factors. Different approaches have been applied to assess the supplier/s. Most of these studies are based upon the supplier/s' capabilities. It may be neither rational nor economical to deal with each item via a generic material control system. Furthermore, supplier...
متن کاملVOLUME MINIMIZATION WITH DISPLACEMENT CONSTRAINTS IN TOPOLOGY OPTIMIZATION OF CONTINUUM STRUCTURES
In this paper, a displacement-constrained volume-minimizing topology optimization model is present for two-dimensional continuum problems. The new model is a generalization of the displacement-constrained volume-minimizing model developed by Yi and Sui [1] in which the displacement is constrained in the loading point. In the original model the displacement constraint was formulated as an equali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006